Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

We study the resource loading problem, which arises in tactical capacity planning. In this one has to plan intensity of execution a set orders minimize cost function that penalizes use above given limits and completion after their due dates. Our main contributions include novel mixed-integer linear-programming (MIP)‐based formulation, investigation polyhedra associated with feasible assignments individual orders, comparison our branch-and-cut algorithm based on formulation related polyhedral results other MIP formulations. The computational demonstrate superiority approach. proofs, we fundamental Egon Balas disjunctive programming.